Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(a(x))) → b(a(x))

Q is empty.


↳ QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(a(x))) → b(a(x))

Q is empty.

We use [23] with the following order to prove termination.

Recursive Path Order [2].
Precedence:
trivial